Stationary Tangent: the Discrete and Non-smooth Case

نویسنده

  • U. KEICH
چکیده

In [5] we define a stationary tangent process, or a locally optimal stationary approximation, to a real non-stationary smooth Gaussian process. This paper extends the idea by constructing a discrete tangent – a “locally” optimal stationary approximation – for a discrete time, real Gaussian process. Analogously to the smooth case, our construction relies on a generalization of the recursion formula for the orthogonal polynomials of the spectral distribution function. More precisely, we use a generalization of the Schur parameters to identify the stationary tangent. By way of discretizing, we later demonstrate how this tangent can be used to obtain “good” local stationary approximations to non-smooth continuous time, real Gaussian processes. Further, we demonstrate how, analogously to the curvatures in the smooth case, the Schur parameters can be used to determine the order of stationarity of a non-smooth process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Possible Definition of a Stationary Tangent

This paper offers a way to construct a locally optimal stationary approximation for a non-stationary Gaussian process. In cases where this construction leads to a unique stationary approximation we call it a stationary tangent. This is the case with Gaussian processes governed by smooth n-dimensional correlations. We associate these correlations with equivalence classes of curves in R. These ar...

متن کامل

A possible de nition of a stationary tangent

This paper o ers a way to construct a locally optimal stationary approximation for a nonstationary Gaussian process. In cases where this construction leads to a unique stationary approximation we call it a stationary tangent. This is the case with Gaussian processes governed by smooth n-dimensional correlations. We associate these correlations with equivalence classes of curves in R. These are ...

متن کامل

Some theoretical limitations of second-order algorithms for smooth constrained optimization

In second-order algorithms, we investigate the relevance of the constant rank of the full set of active constraints in ensuring global convergence to a second-order stationary point. We show that second-order stationarity is not expected in the non-constant rank case if the growth of the so-called tangent sequence, associated with a second-order complementarity measure, is not controlled. We th...

متن کامل

The Lie Algebra of Smooth Sections of a T-bundle

In this article, we generalize the concept of the Lie algebra of vector fields to the set of smooth sections of a T-bundle which is by definition a canonical generalization of the concept of a tangent bundle. We define a Lie bracket multiplication on this set so that it becomes a Lie algebra. In the particular case of tangent bundles this Lie algebra coincides with the Lie algebra of vector fie...

متن کامل

A Degree Estimate for PolynomialSubdivision Surfaces of Higher RegularitybyUlrich

Subdivision algorithms can be used to construct smooth surfaces from control meshes of arbitrary topological structure. However, in contrast to tangent plane continuity, which is well understood, very little is known about the generation of subdivision surfaces of higher regularity. This work presents an estimate for piecewise polynomial subdivision surfaces by pointing out that curvature conti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002